#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,k;cin>>n>>k;
    for(LL i=1;i<=n;i++) cin>>a[i];
    LL gcd=0;
    for(LL j=1;j<=n;j++){
        gcd=__gcd(gcd,a[j]-a[1]);
    }
    bool flag=1;
    for(LL i=1;i<=n;i++){
        if((k-a[i])%gcd==0){
            flag=0;
            cout<<"YES"<<"\n";
            break;
        }
    }
    if(1==flag) cout<<"NO"<<"\n";
  }
return 0;
}
